Easy Realignment of k-DOP Bounding Volumes
نویسندگان
چکیده
In this paper we reconsider pairwise collision detection for rigid motions using a k-DOP bounding volume hierarchy. This data structure is particularly attractive because it is equally efficient for rigid motions as for arbitrary point motions (deformations). We propose a new efficient realignment algorithm, which produces tighter results compared to all known algorithms. It can be implemented easily in software and in hardware. Using this approach we try to show, that k-DOP bounding volumes can keep up with the theoretically more efficient oriented bounding boxes (OBBs) in parallel-close-proximity situations.
منابع مشابه
Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy
We introduce a new type of bounding-volume hierarchy, the c-oriented rotated-box tree, or c-rb-tree for short. A c-rb-tree uses boxes as bounding volumes, whose orientations come from a fixed set of predefined box orientations. We theoretically and experimentally compare our new c-rb-tree to two existing bounding-volumes hierarchies, namely c-dop-trees and box-trees.
متن کاملEfficient Bounding Volume Hierarchies for Hair Simulation
We study the practicability and performance of different classes of bounding volume hierarchies for self collision detection in complex human hair styles with authentic geometrical properties. In particular, we focus on topology based hierarchies which allow for fast update schemes as well as conventional spatially adapted hierarchies. In this context, we introduce a parameterized k-DOP approac...
متن کاملSimulation and verification of belt grinding with industrial robots
A new simulation and verification system of belt grinding with industrial robots is presented in this paper. The workpiece surface is represented by a discrete height field, an array of extended height segments, and a fast collision detection algorithm using k-DOP bounding volumes is adopted to accelerate the localization of the contact area. A local grinding model is incorporated to decide the...
متن کاملTighter Bounding Volumes for Better Occlusion Culling Performance
Bounding volumes are used in computer graphics to approximate the actual geometric shape of an object in a scene. The main intention is to reduce the costs associated with visibility or interference tests. The bounding volumes most commonly used have been axis-aligned bounding boxes and bounding spheres. In this paper, we propose the use of discrete orientation polytopes (k-dops) as bounding vo...
متن کاملLightweight Bounding Volumes for Ray Tracing
This paper presents a memory-efficient auxiliary data structure for ray tracing called a lightweight bounding volume hierarchy, or LBVH. The new data structure reduces memory requirements in three ways: using implicit indexing, limited precision numbers, and a high branching factor. We show that LBVHs can be nearly as effective as standard bounding volumes in terms of speed while using signific...
متن کامل